Optimal project planning through feasible path analysis
نویسندگان
چکیده
In this paper we present a powerful technique for analysing production networks in the presence of decision-making variables and cost exibility. Processes are modelled as a network , similar to PERT/CPM schemes, but with built-in decision and cost variables. For minimal increased complexity in the development of the network, we show that powerful analysis and optimisation techniques are enabled. The concept of feasible paths is introduced as a key factor in the analysis and optimisation process.
منابع مشابه
Solving Critical Path Problem in Project Network by a New Enhanced Multi-objective Optimization of Simple Ratio Analysis Approach with Interval Type-2 Fuzzy Sets
Decision making is an important issue in business and project management that assists finding the optimal alternative from a number of feasible alternatives. Decision making requires adequate consideration of uncertainty in projects. In this paper, in order to address uncertainty of project environments, interval type-2 fuzzy sets (IT2FSs) are used. In other words, the rating of each alternativ...
متن کاملRobot Path Planning Based on Random Coding Particle Swarm Optimization
Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on ran...
متن کاملPATH PLANNING ALGORITHM FOR A CAR-LIKE ROBOT BASED ON CELL DECOMPOSITION METHOD NURHANUM BINTI OMAR A project report submitted in partial Fulfillment of the requirement for the award of the Degree of Master of Electrical Engineering
This project proposes an obstacle avoiding path planning algorithm based on cell decomposition method for a car-like robot. Dijkstra’s algorithm is applied in order to find the shortest path. Using cell decomposition, the free space of the robot is exactly partitioned into cells. Then, the connectivity graph is created followed by calculating the shortest path by Dijkstra’s algorithm. This proj...
متن کاملOptimal Path Planning and Reconfiguration Strategy for Reconfigurable Cable Driven Parallel Robots
Cable-Driven Parallel Robots (CDPRs) are a class of parallel robots whose legs are composed of cables. The cables are fixed to a mobile platform and the robot base frame. CDPRs are limited by the cable interferences and the collisions between cables and environment. Reconfigurable Cable-Driven Parallel Robots (RCDPRs) are able to reduce these drawbacks. By reconfigurable, we means that the cabl...
متن کاملMobile Robot Path Planning Using Hybrid Genetic Algorithm and Traversability Vectors Method
The shortest/optimal path generation is essential for the efficient operation of a mobile robot. Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. However, the genetic algorithm path planning approach in the previous works requires a preprocessing step that captur...
متن کامل